General bounds on holographic complexity
نویسندگان
چکیده
A bstract We prove a positive volume theorem for asymptotically AdS spacetimes: the maximal slice has nonnegative vacuum-subtracted volume, and vanishes if only spacetime is identically pure AdS. Under Complexity=Volume proposal, this constitutes holographic complexity theorem. The result features number of parallels with energy theorem, including assumption an condition that excludes false vacuum decay (the weak condition). Our proof rigorously established in broad generality four bulk dimensions, we provide strong evidence favor generalization to arbitrary dimensions. techniques also yield Lloyd’s bound class spacetimes. further establish partial rigidity wormholes: wormholes given throat size are more complex than AdS-Schwarzschild same size.
منابع مشابه
Some new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملLower Bounds on Communication Complexity ∗
A notion of ”communication complexity” is used to formally measure the degree to which a Boolean function is ”global”. An explicit combinatorial lower bound for this complexity measure is presented. In particular, this leads to an exp(Ω( √ n)) lower bound on the complexity of depth-restricted contact schemes computing some natural Boolean functions in NP.
متن کاملGeneral Sample Complexity lower bounds for Parametric Estimation
In the previous lecture, we introduced the notion of minimax error/risk, and looked at how it can be lower bounded by sample complexity for a well studied case: estimating the mean of a Gaussian distribution with known variance. In this lecture, we introduce techniques which work for more general parametric classes, using which the sample complexity lower bounds derived in the previous lecture ...
متن کاملBounds on general entropy measures
We show how to determine the maximum and minimum possible values of one measure of entropy for a given value of another measure of entropy. These maximum and minimum values are obtained for two standard forms of probability distribution (or quantum state) independent of the entropy measures, provided the entropy measures satisfy a concavity/convexity relation. These results may be applied to en...
متن کاملHolographic Bounds on the UV Cutoff Scale in Inflationary Cosmology
We discuss how holographic bounds can be applied to the quantum fluctuations of the inflaton. In general the holographic principle will lead to a bound on the UV cutoff scale of the effective theory of inflation, but it will depend on the coarse-graining prescription involved in calculating the entropy. We propose that the entanglement entropy is a natural measure of the entropy of the quantum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2022
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep01(2022)040